Manta ray foraging and Gaussian mutation-based elephant herding optimization for global optimization

نویسندگان

چکیده

Abstract The elephant herding optimization (EHO) algorithm is a novel metaheuristic optimizer inspired by the clan renewal and separation behaviors of populations. Although it has few parameters easy to implement, suffers from lack exploitation, leading slow convergence. This paper proposes an improved EHO called manta ray foraging Gaussian mutation-based for global (MGEHO). updating operator in original replaced somersault strategy rays, which aims optimally adjust patriarch positions. Additionally, dynamic convergence factor set balance exploration exploitation. gaussian mutation adopted enhance population diversity, enabling MGEHO maintain strong local search capability. To evaluate performances different algorithms, 33 classical benchmark functions are chosen verify superiority MGEHO. Also, enhanced paradigm compared with other advanced algorithms on 32 IEEE CEC2014 CEC2017. Furthermore, scalability test, analysis, statistical diversity running time analysis demonstrate effectiveness various aspects. results illustrate that superior terms solution accuracy stability. Finally, applied solve three real engineering problems. comparison show this method powerful auxiliary tool handling complex

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering

The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...

متن کامل

Elephant Herding Optimization based Vague Association Rule Mining Algorithm

Huge amount of data is being gathered, processed and analyzed in every sector to derive useful information. So, automated tool like data mining has evolved in order to extract information and solve the overhead in manual approach. Association rule mining which is an essential part of data mining fails to address the vague and uncertain situations. In shopping applications, traditional approach ...

متن کامل

Gaussian Processes for Global Optimization

In this paper we frame global optimization as a sequential decision problem. Imagine that we have an unknown and expensive-to-evaluate objective function y(x) that we seek to minimize. The cost associated with computing y(x) compels us to select the location of each new evaluation very carefully. Our problem’s ultimate task is to return a final point xM in the domain, and we define the loss ass...

متن کامل

Performance of Elephant Herding Optimization Algorithm on CEC 2013 real parameter single objective optimization

Numerous real life problems represents hard optimization problems that cannot be solved by deterministic algorithm. In the past decades various different methods were proposed for these kind of problems and one of the methods are nature inspired algorithms especially swarm intelligence algorithms. Elephant herding optimization algorithm (EHO) is one of the recent swarm intelligence algorithm th...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering With Computers

سال: 2021

ISSN: ['0177-0667', '1435-5663']

DOI: https://doi.org/10.1007/s00366-021-01494-5